Lattice bandwidth of random graphs
نویسندگان
چکیده
McDiarmid, C. and Z. Miller, Lattice bandwidth of random graphs, Discrete Applied Mathematics 30 (1991) 221-227. The bandwidth of a random graph has been well studied. A natural generalization of bandwidth involves replacing the path as host graph by a multi-dimensional lattice. In this paper we investigate the corresponding behavior for random graphs.
منابع مشابه
On the bandwidth of Mobius graphs
Bandwidth labelling is a well known research area in graph theory. We provide a new proof that the bandwidth of Mobius ladder is 4, if it is not a $K_{4}$, and investigate the bandwidth of a wider class of Mobius graphs of even strips.
متن کاملConvergence Theorems For Some Layout Measures On Random Lattice And Random Geometric Graphs
This work deals with convergence theorems and bounds on the cost of several layout measures for lattice graphs, random lattice graphs and sparse random geometric graphs. Specifically, we consider the following problems: Minimum Linear Arrangement, Cutwidth, Sum Cut, V ertex Separation, Edge Bisection and V ertex Bisection. For full square lattices, we give optimal layouts for the problems still...
متن کاملDesign and Evaluation of a Method for Partitioning and Offloading Web-based Applications in Mobile Systems with Bandwidth Constraints
Computation offloading is known to be among the effective solutions of running heavy applications on smart mobile devices. However, irregular changes of a mobile data rate have direct impacts on code partitioning when offloading is in progress. It is believed that once a rate-adaptive partitioning performed, the replication of such substantial processes due to bandwidth fluctuation can be avoid...
متن کاملDependent Lattice Random Elements
In this study, we first introduce the Banach lattice random elements and some of their properties. Then, using the order defined in Banach lattice space, we introduce and characterize the order negatively dependence Banach lattice random elements by the order defined in Banach lattice space. Finally, we obtain some limit theorems for the sequence of order negatively dependence Banach lattice ra...
متن کاملSmall world graphs: characterization and alternative constructions
Small world graphs are examples of random graphs which mimick empirically observed features of social networks. We propose an intrinsic definition of small world graphs, based on a probabilistic formulation of scaling properties of graph properties, which does not rely on an underlying lattice nor on any particular construction. Our definition is shown to encompass existing models of small worl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 30 شماره
صفحات -
تاریخ انتشار 1991